package com.leetcode;

/**
 * 35. 搜索插入位置
 * 迭代法
 *
 * @author fy
 * @date 2022/4/19 18:48
 */
public class Solution35_1 {

    public int searchInsert(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        while (left <= right) {
            int mid = left + ((right - left) >> 1);
            if (nums[mid] == target) {
                return mid;
            } else if (nums[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return left;
    }

}
